package LC;

import java.util.HashMap;

/**
 * @ClassName LC130
 * @Description: TODO
 * @Author hl
 * @Date 2020/8/17
 * @Version V1.0
 **/
public class LC130 {
    public static void main(String[] args) {
        int i=0;
        if(++i>=1){
            System.out.println("nihao ");
        }
    }

    public void solve(char[][] board) {
        //先填充最外侧，剩下的就是里侧了。
        int n=board.length;
        int m=board[0].length;



    }
}
